package leetcode.bfs;

import leetcode.dp.common.DPUtils;

class Solution1210 {
    public int minimumMoves(int[][] grid) {
        return DPUtils.minimumMoves(grid);
    }
}

public class leetcode1210 {
    public static void main(String[] args) {
        Solution1210 solution1210 = new Solution1210();
        int[][] grid = {
                {0, 0, 0, 0, 0, 1},
                {1, 1, 0, 0, 1, 0},
                {0, 0, 0, 0, 1, 1},
                {0, 0, 1, 0, 1, 0},
                {0, 1, 1, 0, 0, 0},
                {0, 1, 1, 0, 0, 0}
        };
        System.out.println(solution1210.minimumMoves(grid));
    }
}
